Verification of Random Graph Transformation Systems
نویسندگان
چکیده
منابع مشابه
A Temporal Graph Logic for Verification of Graph Transformation Systems
We extend our approach for verifying properties of graph transformation systems using suitable abstractions. In the original approach properties are specified as formulae of a propositional temporal logic whose atomic predicates are monadic second-order graph formulae. We generalize this aspect by considering more expressive logics, where edge quantifiers and temporal modalities can be interlea...
متن کاملParameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations
We introduce a new class of graph transformation systems in which rewrite rules can be guarded by universally quantified conditions on the neighbourhood of nodes. These conditions are defined via special graph patterns which may be transformed by the rule as well. For the new class for graph rewrite rules, we provide a symbolic procedure working on minimal representations of upward closed sets ...
متن کاملVerification of Graph Transformation Systems with Context-Free Specifications
We introduce an analysis method for graph transformation systems which checks that certain forbidden graphs are not reachable from the start graph. These forbidden graphs are specified by a contextfree graph grammar. The technique is based on the approximation of graph transformation systems by Petri nets and on semilinear sets of markings. Especially we exploit Parikh’s theorem which says that...
متن کاملCompositional Verification of Reactive Systems Specified by Graph Transformation
A loose semantics for graph transformation rules which has been developed recently is used in this paper for the compositional verification of specifications. The main conceptual tool here is the notion of view, that is, an incomplete specification describing only a certain aspect of the overall system. A view anticipates the (potential) behavior of the complete system by its loose semantics. T...
متن کاملModeling and Verification of Reliable Messaging by Graph Transformation Systems
Due to the increasing need of highly dependable services in Service-Oriented Architectures (SOA), service-level agreements include more and more frequently such non-functional aspects as security, safety, availability, reliability, etc. Whenever a service can no longer be provided with the required QoS, the service requester needs to switch dynamically to a new service having adequate service p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2007
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2007.04.017